Tabu search heuristic for inventory routing problem with stochastic demand and time windows

This study proposes the hybridization of tabu search (TS) and variable neighbourhood descent (VND) for solving Inventory Routing Problems with Stochastic Demand Time Windows (IRPSDTW). Vendor Managed (VMI) is among most used approaches managing supply chains comprising multiple stakeholders, implementing VMI require addressing Problem (IRP). Considering practical constraints related to demand uncertainty time constraint, proposed model combines multi-item replenishment schedules unknown arrange delivery paths, where actual amount only known upon arrival at a customer location limit. The method starts from initial solution that considers windows uses TS solve problem. As an extension, VND conducted jump its local optimal. results show can IRPSDTW, especially uniformly distributed locations.